Logical Definability of NP-Optimization Problems with Monadic Auxiliary Predicates
نویسنده
چکیده
Given a rst{order formula ' with predicate symbols e 1 such a solution is deened to be jS 0 j. In a strong sense, every polynomially bounded NP{optimisation problem has such a representation, however, it is shown here that this is no longer true if the predicates s 1 ; : : : ; s r are restricted to be monadic. The result is proved by an Ehrenfeucht{Fra ss e game and remains true in several more general situations.
منابع مشابه
Logical Definability of NP Optimization Problems
We investigate here NP optimization problems from a logical deenability standpoint. We show that the class of optimization problems whose optimum is deenable using rst-order formulae coincides with the class of polynomially bounded NP optimization problems on nite structures. After this, we analyze the relative expressive power of various classes of optimization problems that arise in this fram...
متن کاملWeighted NP Optimization Problems: Logical Definability and Approximation Properties
Extending a well-known property of NP optimization problems in which the value of the optimum is guaranteed to be polynomially bounded in the length of the input, it is observed that, by attaching weights to tuples over the domain of the input, all NP optimization problems admit a logical characterization. It is shown that any NP optimization problem can be stated as a problem in which the cons...
متن کاملDefinability and decidability of binary predicates for time granularity
In this paper we study the definability and decidability of binary predicates for time granularity in monadic languages interpreted over finitely and infinitely layered structures. We focus our attention on the equi-level (resp. equi-column) predicate constraining two time points to belong to the same layer (resp. column) and on the horizontal (resp. vertical) successor predicate relating a tim...
متن کاملGraph structure and Monadic second-order logic
Exclusion of minor, vertex-minor, induced subgraph Tree-structuring Monadic second-order logic : expression of properties, queries, optimization functions, number of configurations. Mainly useful for tree-structured graphs (Second-order logic useless) Tools to be presented Algebraic setting for tree-structuring of graphs Recognizability = finite congruence ≡ inductive computability ≡ finite det...
متن کاملOn Second-Order Monadic Monoidal and Groupoidal Quantifiers
We study logics defined in terms of second-order monadic monoidal and groupoidal quantifiers. These are generalized quantifiers defined by monoid and groupoid word-problems, equivalently, by regular and context-free languages. We give a computational classification of the expressive power of these logics over strings with varying built-in predicates. In particular, we show that ATIME(n) can be ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992